A Large-Scale Scheduling Method for Multiple Agile Optical Satellites

This study investigates the scheduling problem of multiple agile optical satellites with large-scale tasks. is difficult to solve owing time-dependent characteristic satellites, complex constraints, and considerable solution space. To problem, we propose a method based on an improved sine cosine algorithm task merging approach. We first establish model constraints observation action describe problem. Then, proposed search for optimal maximum profit ratio. An adaptive factor greedy are adopted improve algorithm. Besides, reallocation mechanism developed efficiency. Experimental results demonstrate superiority over comparison algorithms.